Method and arrangement for encoding or decoding a sequence of digital data

ABSTRACT

A method is provided for encoding and decoding a sequence of digital data, according to which a portion of the sequence of digital data corresponds to a data block that includes several data packets, at least two data packets per data block containing an identifier. The position of the data packet within the corresponding data block can be determined based on the identifier, and the data is encoded or decoded by taking into account the identifier.

BACKGROUND OF THE INVENTION

A Real-time Transfer Protocol (RTP) that controls the encoding,transmission, and decoding of real-time data, such as audio and videodata, is known from [1]. According to [1], an RTP header contains a16-bit sequential number that is incremented with each RTP packet. Thesequential number enables the recipient to detect any packet lossesoccurring during transmission and to order the packets in their correctsequence. For data security reasons, a random number is used as theinitial value for the first data packet. According to [ 1], an RTPheader contains an option to identify the limits of data blocks in thedata stream by setting marker bits.

What are termed interleaver blocks, whereby the data is read in anencoding device row-by-row into a matrix and column-by-column from thematrix, are known from [2]. The entire interleaver block is reassembledin a decoding device before the data contained in the block is used.

The use of redundancy information (also: redundancy) on the basis ofwhich transmission errors can be compensated is known from [3]. Beforebeing transmitted over a faulty transmission channel, data beingtransmitted (content data) is hereby additionally provided withredundancy information generated, using known methods, from the databeing transmitted. The content data is then sent to a recipient on thetransmission channel along with the redundancy information. On therecipient's side, it then is possible to compensate transmission errorsin such a way that the content data is reconstituted based on theredundancy information. Known error correction methods are employed forthis (see [4]).

A method for the unequal error protection (UXP) of data whereby errorprotection is varied within a data block by assigning the data differentamounts of redundancy information is described in [5]. According to [5],a number of the data packets in a data block is variable and isindicated in a separate data field in the UXP header assigned to eachdata packet.

The printed patent specification U.S. Pat. No. 6,055,663 describes amethod via which an improved error-robust multiplexing process is madepossible.

Some data packets are lost when data is transmitted on faulty channels.This is particularly disadvantageous when also involving the loss ofdata packets which each include a marker bit indicating the limit of thedata block. In this case, before being decoded the data packets willhave to remain buffered until their positions within the individual datablocks or, as the case may be, the limits of the various data blocks canbe reconstituted.

The present invention is therefore directed toward making it easier toreconstitute the limits of the data blocks.

Accordingly, method is disclosed for encoding a sequence of digital datafor achieving the above-referenced directive. A portion of the sequenceof digital data corresponds to a data block and includes several datapackets. The data packets contain an identifier based on which theposition of the data packet within the associated data block isdetermined. Each of the data packets further includes informationrelating to the data block width. Furthermore, at least one data packetper data block contains the identifier and at least one further datapacket contains the information relating to the data block width. Theidentifier and the information relating to the data block width aretransmitted alternately, particularly according to a predefinablerepetition pattern, in a data field. The data is encoded taking theidentifier into consideration.

The present invention is furthermore directed toward a method fordecoding a sequence of digital data. A portion of the sequence ofdigital data corresponds to a data block and includes several datapackets. The data packets contain an identifier based on which theposition of the data packet within the associated data block isdetermined. Each of the data packets further contains informationrelating to the data block width. Furthermore, at least one data packetper data block contains the identifier and at least one further datapacket contains the information relating to the data block width. Theidentifier and the information relating to the data block width aretransmitted alternately, particularly according to a predefinablerepetition pattern, in a data field. The data is decoded taking theidentifier into consideration.

An advantage of the present invention is that, via the identifier, thepositions of the received data packets within the associated data blockcan be immediately determined at the beginning of data transmissionand/or when data packets are lost. The effort and expense required fordata buffering being substantially reduced, it is consequently alsopossible to run a real-time application; for example, video telephony orany other multimedia application. The buffer for the data, thus, alsocan be significantly reduced in size in the decoding device or eventotally dispensed with. Owing to the fact that only a single data fieldis required for transmitting the identifier and the information relatingto the data block width, the amount of data to be transmitted is notincreased in spite of the two functionalities in a single data field.

A development of the present invention is that the sequence of digitaldata includes a sequence of progressively encoded data (progressivedata), such as progressively encoded images or image data streams, withits also being possible for the progressive data to be image data.Progressive data is temporally staggered in terms of its degree ofdetail, meaning that the image, for instance, is initially transmittedwith a coarse resolution so that, although the image can be represented,its details are largely unrecognizable. Image refinements are thereaftertransmitted step-by-step so that the image's resolution constantlyimproves as transmission progresses further.

In an additional development of the present invention, the data blockincludes redundancy information. This enables an error correction methodto correct data errors occurring during transmission and to reconstitutethe data.

Another development of the present invention is that a beginning and anend of the data block are determined on the basis of the identifier ofthe data packets.

An additional development of the present invention is that the number ofdata packets containing an identifier is predefined in such a way thatevery n-th data packet receives the identifier.

Another development of the present invention is that the number of datapackets containing an identifier is predefined in such a way that thedata field of every n-th data packet contains the identifier and some ofthe remaining data packets each contain the data block width in theirdata field.

In another development of the present invention, the predefinable numberof data packets containing an identifier is every other data packet.

In an additional development of the present invention, the data block isan interleaver block. In the encoding device the data is hereby read,for example, row-by-row into the interleaver block and, for example,column-by-column from the interleaver block and then transmitted. If adata packet, which is to say a column of the interleaver block, is lostduring data transmission, this data loss will be distributed over therows of the interleaver block. If the data rows contain redundancyinformation, these errors can be corrected up to a certain number via anerror correction method, with the amount of redundancy informationdirectly influencing the number of errors that can be corrected.

An additional development of the present invention is that a sequence ofthe data blocks is identifiable, particularly based on a time stamp or aserial number. The time stamp is a digital identifier indicating, forexample, the time at which an item of data, in this case the data block,was sent.

An additional development of the present invention is that theidentifier for determining the position of the data packet within thedata block is a sequential number. The sequential number is, forexample, a serial number of the data packets. For data security reasons,a random number or a number “0” or “1” can be selected as the initialvalue.

In an additional development of the present invention, a Real-timeTransfer Protocol (RTP) is used. RTP makes services available fortransmitting real-time data, such as multimedia data. Such servicesinclude assigning time stamps and sequential numbers to data packets.

The sequential number of the RTP is used within the scope of the presentinvention to define the identifier for determining the position of thedata packet within the data block.

An additional development of the present invention is that a method forunequal error protection, such as UXP, is used. Progressive data withina data block is hereby provided in each case, with a different amount ofredundancy information in order to take into consideration the fact thatthe progressive data of a unit, such as an image, requiring to berepresented, builds one set upon another, which is to say the differentstages in the progression are to be taken into account in distributingthe redundancy information. It is of practical advantage to provide alarge amount of redundancy information at the beginning of theprogressive data, while increasingly less redundancy information can beprovided as the degree of detail increases. The number of data packetsin a data block, what is termed the data block width, can vary per datablock.

The length of the identifier preferably should be matched to that of thedata field so that the same data field can be used for the identifierfor determining the position of the data packet within the data blockand for the data block width. If, for example, the data field for thedata block width is 8 bits long and the identifier is determined from a16-bit sequential number in the RTP header, then an 8-bit identifier canbe generated from the 16-bit identifier by omitting the higher-value 8bits.

A system for encoding a sequence of digital data is furthermoredisclosed for achieving the the present invention. Such arrangementprovides for a processor unit embodied in such a way that a portion ofthe sequence of digital data is a data block and contains several datapackets. The data packets contain an identifier based on which theposition of the data packet within the associated data block can bedetermined. Each of the data packets further contains informationrelating to the data block width. Furthermore, at least one data packetper data block contains the identifier and at least one further datapacket contains the information relating to the data block width. Theidentifier and the information relating to the data block width aretransmitted alternately, particularly according to a predefinablerepetition pattern, in a data field. The data is encodable taking theidentifier into consideration.

A system for decoding a sequence of digital data is furthermoredisclosed for achieving the present invention. Such arrangement providesfor a processor unit embodied in such a way that a portion of thesequence of digital data is a data block and includes several datapackets. The data packets contain an identifier based on which theposition of the data packet within the associated data block can bedetermined. Each of the data packets further contains informationrelating to the data block width. Furthermore, at least one data packetper data block contains the identifier and at least one further datapacket contains the information relating to the data block width. Theidentifier and the information relating to the data block width aretransmitted alternately, particularly according to a predefinablerepetition pattern, in a data field. The data is decodable taking theidentifier into consideration.

Such systems are suitable in particular, for implementing the methodsaccording to the present invention or one of their developmentselucidated in the foregoing.

The present invention, or any development described in the foregoing,also can be implemented via a computer program product having a storagemedium on which is stored a computer program that is capable of runningon a computer and which carries out the present invention ordevelopment.

Additional features and advantages of the present invention aredescribed in, and will be apparent from, the following DetailedDescription of the Invention and the Figures.

BRIEF DESCRIPTION OF THE FIGURES

FIG. 1 is a sketch illustrating the principle of an interleaver block.

FIG. 2 is a sketch illustrating a method for encoding digital data.

FIG. 3 is a sketch illustrating a method for decoding digital data.

FIG. 4 shows the structure of a transmission packet.

FIG. 5 shows an instance of determining the position of the data packetswithin data blocks.

FIG. 6 shows the structure of a transmission system.

FIG. 7 shows a processor unit.

DETAILED DESCRIPTION OF THE INVENTION

FIG. 1 is a sketch illustrating the principle of how an interleaverblock functions.

A progressive digital data sequence 101 including data 1 to 12 has beendivided by way of example into three refinement steps, with data 1 to 3being the most important data, data 4 to 7 being less important and,finally, data 8 to 12 having in this example the least significancewithin the progressive data sequence 101.

An interleaver block 102 contains 3 rows and 6 columns. For each row inthe interleaver block 102, the data of a refinement step is filed in theinterleaver block 102 and redundancy information is generated for therespective data of a refinement step and co-filed in the interleaverblock 102. In FIG. 1 the interleaver block contains three rows: Data 1to 3 in the first row is provided with redundancy information R1, R2,and R3, data 4 to 7 in a second row is provided with redundancyinformation R4 and R5, and data 8 to 12 in a third row is provided withredundancy information R6. As such, data 1 to 3 in the first row of theinterleaver block 102 can be reconstituted with the greatest probability(compared to the data in the respective other two rows) because thefirst row was assigned the largest amount of redundancy information.

This gives rise in the interleaver block 102 to a redundancy profile 110ensuing from the described distribution of data 1 to 12 and from thegenerated redundancy information R1 to R6 within the interleaver block102.

Data 1 to 12, along with redundancy information R1 to R6, issubsequently read out from the interleaver block 102 column-by-column,with the contents of the columns each being combined in a data packet103 to 108: Data packet 103 includes data 1, 4, and 8, data packet 104comprises data 2, 5, and 9, data packet 105 includes data 3, 6, and 10,data packet 106 includes redundancy information R1 and data 7 and 11,data packet 107 includes redundancy information R2 and R4 and data 12,and data packet 108 includes redundancy information R3, R5, and R6.

A read-out data sequence 109 is thus: {1, 4, 8}, {2, 5, 9}, {3, 6, 10},{R1,7, 11}, {R2,R4, 12}, {R3,R5,R6}.

FIG. 2 is a sketch illustrating a method for encoding digital data.

A sequence of progressive data 201, consisting here by way of example ofa data block, is routed to an encoding unit 202 containing an optimizingunit 203 and a packing unit 210. The sequence 201 is first routed to theoptimizing unit 203 and analyzed there. The analysis supplies astructure of the progression of the data on the basis of which aredetermined a length on an interleaver block 204 and a redundancy profile205. The redundancy profile 205 belongs to the administrative data 206required for evaluating the interleaver block 204 on the recipient'sside. Redundancy information 207 for the administrative data 206 andredundancy information 208 and 209 for the digital data 201 is generatedin the optimizing unit 203, it hereby being the case that the greaterthe amount is of redundancy information provided, the more important isthe data, which is to say, inter alia, dependent on the refinement stepof the progression (see the explanations above).

The administrative data 206 is first filed in the interleaver block 204and the largest amount of redundancy information 207 assigned to thedata so that, for instance, as many transmission errors as possible canbe corrected. The interleaver block 204 is then filled row-by-row withthe progressive data 201 and associated redundancy information 208 and209.

When the interleaver block 204 has been filled with data and redundancyinformation, its contents will, as explained with the aid of FIG. 1, beread out column-by-column and routed to the packing unit 210. Packing ofthe contents of a column 211 of the interleaver block 204 is shown byway of example for the packing unit 210. The data packet 211corresponding to the data in the column 211 hereby will be provided witha header 217 and combined into a data packet 218, referred to below astransmission packet 218.

The header 217 contains a field 219 which, in turn, contains asequential number for transmission packet 218. The header 217 furthercontains a field 220 in which is alternately indicated an identifier onthe basis of which the position of the data packet 211 within therespective interleaver block 204 can be determined and a width of therespective interleaver block 204. The header 217 furthermore contains afield 221 in which is indicated a time stamp for the respectiveinterleaver block 204, with each interleaver block of an image sequencereceiving a different value as the time stamp so that individualinterleaver blocks are mutually distinguishable. It should be noted herethat the sequence of digital data 201 contains several progressivelyencoded units, with it preferably being the case that one each of a unitof this kind is filed in the interleaver block. The interleaver blockscan vary in length depending on the progressively encoded unit.Individual images in the sequence of digital data 201 are preferablyprogressively encoded.

Analogously to column 211, the remaining columns 212 to 216 of theinterleaver block 204 are packed into transmission packets 222 to 226and transmitted along with transmission packet 218. This hereby producesan encoded data sequence 228 corresponding to a data block 227. The datablock 227 is also referred to as a transmission block.

FIG. 3 shows a method for decoding digital data.

A sequence of digital data 301 contains a data block 302 which, in turn,contains several transmission packets 303 to 308, with each transmissionpacket having a header and a data packet.

Transmission packet 303 thus contains a header 309 and a data packet315, transmission packet 304 a header 310 and a data packet 316,transmission packet 305 a header 311 and a data packet 317, transmissionpacket 306 a header 312 and a data packet 318, transmission packet 307 aheader 313 and a data packet 319, and transmission packet 308 a header314 and a data packet 320. The sequence of digital data that was, inparticular, received on a faulty transmission channel is routed to adecoding unit containing an unpacking unit 322 and an evaluation unit325.

Transmission packets 303 to 308 are first routed to the unpacking unit322 and data packets 315 to 320 are unpacked. Unpacking of data packet315 from transmission packet 303 is shown by way of example for theunpacking unit 322. Thus, first the header 309 of transmission packet303 is evaluated and, on the basis of the header 309, particularly onthe basis of the identifier 323 contained therein, the column positionof data packet 315 within an interleaver block 324 is determined. Theproblem of determining the position is explained in detail further belowin FIG. 5.

Transmission packet 303 remains buffered in the unpacking unit 322 untilthe position of data packet 315 in the interleaver block 324 can bedetermined.

If it was possible to determine the position of data packet 315 withinthe interleaver block 324, the data packet 315 will be filed as thecolumn in the interleaver block 324 of the evaluation unit 325. Theinterleaver block 324 is analogously filled column-by-column with datapackets 316 to 320.

The contents of the interleaver block 324 are then evaluated row-by-row;for example, the image information is read out. Data 326 containsadministrative information on the basis of which a redundancy profile327 can be constructed for the interleaver block 324. The boundarybetween content information, whether this be of an administrative nature(see data 326) or pure image data (see data 331), is determined with theredundancy profile.

If data packets 315 to 320 of the interleaver block 324 have been lostowing, for example, to faulty transmission, the resulting errors can becorrected (up to a certain frequency whose upper limit is defined by theamount of redundancy information transmitted) in the evaluation unit 325via an error correction method with the aid of redundancy information328, 329, and 330, it here being the case that, for example, the loss(only) of data packet 316 means that a column of the interleaver block324 has to be restored, which, in terms of the arrangement explainedabove of the redundancy information, can be done row-by-row, with itbeing possible owing, in particular, to the progression of the data, toensure that important data in data packet 316 can be reconstituted andunimportant data, where applicable, dispensed with without jeopardizingthe method's functioning capability. The read-out digital data sequence332 can be further processed in an image decoder, in particular in adecoder operating according to an image compression standard such as,for example, MPEG1, MPEG2, MPEG4, H.261, H.263, or H.26L.

FIG. 4 shows the structure of a transmission packet. A transmissionpacket 401 of a transmission block 402 contains a header 403 and a datafield 404 which, in turn, contains a data packet 405. The header 403contains a sequential number field 406 in which is indicated asequential number 407 of transmission packet 401, a designation field408 in which is indicated either an identifier 409 for determining theposition of data packet 405 within data block 413 or a width 410 oftransmission block 402, and a time stamp field 411 in which is indicatedthe value 412 of a time stamp of transmission block 402.

FIG. 5 shows an instance of determining the position of the data packetswithin data blocks.

The explanations below proceed, using the terms employed in thepreceding figures, from an instance of determining the position oftransmission packets within the transmission blocks. The transmissionblock contains several transmission packets each having a header and adata packet (see description relating to FIG. 2). A data block, bycontrast, is produced from the data packets of the respective block. Thetransmission block thus includes the transmission packets (see FIG. 4,401), including their respective headers (see FIG. 4, 403). Theinformation in the headers is essential for the position determiningmentioned.

A data sequence 501 includes transmission blocks 502, 503, 504, and 505,with transmission block 502 containing transmission packets 506 to 513,transmission block 503 containing transmission packets 514 to 519,transmission block 504 containing transmission packets 520 to 525, andtransmission-block 505 containing transmission packets 526 to 529. Thestructure of each transmission packet is described in FIG. 4. Referenceis therefore made to the description applying to FIG. 4 for the termsused for the individual fields.

Transmission packets 506 to 513 belonging to transmission block 502 areeach designated in time stamp field 411 with a time stamp value “A,”transmission packets 514 to 519 belonging to transmission block 503 areeach designated in time stamp field 411 with a time stamp value “B,”transmission packets 520 to 525 belonging to transmission block 504 areeach designated in time stamp field 411 with a time stamp value “C,” andtransmission packets 526 to 529 belonging to transmission block 504 areeach designated in time stamp field 411 with a time stamp value “D.”. Intheir sequential number field 406, transmission packets 506 to 529contain a serial sequential number 407, by way of example beginning with“10” for transmission packet 506 and ending with “33” for transmissionpacket 529.

In their respective designation field, transmission packets having aneven sequential number 506, 508, 510, 512, 514, 516, 518, 520, 522, 524,526, or 528 contain the identifier for determining the position of thetransmission packet within the associated transmission blocks, with theidentifier here consisting of the sequential number of the respectivelyfirst transmission packet in the transmission block, which is to saythat in the designation field 408 transmission packets 506, 508, 510,and 512 contain the value “10,” in the designation field 408transmission packets 514, 516, and 518 contain the value “18,” in thedesignation field 408 transmission packets 520, 522, and 524 contain thevalue “24,” and in the designation field 408 transmission packets 526and 528 contain the value “30.” In the designation field 408, thetransmission packets having an odd sequential number 507, 509, 511, 513,515, 517, 519, 521, 523, 525, 527, or 529 contain the respectivetransmission block width 410, which is to say that in the designationfield 408 transmission packets 507, 509, 511, and 513 contain the value“8” for the width of transmission block 502, in the designation field408 transmission packets 515, 517, and 519 contain the value “6” for thewidth of transmission block 503, in the designation field 408transmission packets 521, 523, and 525 contain the value “6” for thewidth of transmission block 504, and in the designation field 408transmission packets 527 and 529 contain the value “4” for the width oftransmission block 505.

In FIG. 5 it is assumed that transmission packets 507, 508, and 512 oftransmission block 502, transmission packets 514 to 519, which is to saythe entire transmission block 503, transmission packets 521 and 525 oftransmission block 504, and transmission packet 526 of transmissionblock 505 have been lost during data transmission. Lost transmissionpackets are designated in FIG. 5 by an “X” in the respective sequentialnumber field.

Since the last transmission packet 519 of transmission block 503 was notreceived and since transmission blocks 502 to 505 have differenttransmission block widths, the start of transmission block 504 cannot bedetermined from the change in time stamp value from “B” to “C” becauseeither transmission packet 520 or one of transmission packets 514 to 519could be the first transmission packet in transmission block 504. As theboundary between transmission block 503 and transmission block 504cannot be uniquely identified, without the above-described identifierthe received transmission packets 520, 522, 523, and 524 cannot beuniquely assigned their position within transmission block 504. If thelast transmission packet 525 of transmission block 504 and the firsttransmission packet 526 of transmission block 505 have also been lost,without an identifier it is not possible, either, to uniquely identifythe end of transmission block 504 from the change in time stamp valuefrom “C” to “D,” thus making it necessary to buffer more than onetransmission block before the data can be decoded.

It is now possible, via the identifier in the designation field, tomutually compare the sequential number “24” and the identifier “24” onreceipt of transmission packet 520, from which it follows that this isthe first transmission packet of transmission block 504 as theidentifier “24” tallies with the sequential number “24.” Consequently,the received transmission packets 520, 522, 523, and 524 of transmissionblock 504 can be filed directly at the correct positions within thetransmission blocks 504 and it is not necessary to buffer thetransmission packets for a longer period. If transmission packet 520having the sequential number “24” is lost as well, then from theidentifier “24” of the received transmission packet 522 having thesequential number “26” it will be possible immediately to calculate theposition of such transmission packet in transmission block 504: 26−24=2,which is to say there are two transmission packets 520 and 521 intransmission block 504, so the received transmission packet 522 is thethird transmission packet of transmission block 504. Further bufferingof transmission packets of the transmission block concerned is notnecessary in this case either.

In FIG. 5, the sequential number of the first transmission packet in therespective transmission block has been selected as the identifier.Further possibilities are to use the distance from either the first orlast transmission packet in the respective transmission block as theidentifier. As a further exemplary embodiment, the 8-bit data field isused for the transmission block width from UXP to alternately indicatethe transmission block width and the identifier in the transmissionpackets. The identifier is determined from the 16-bit sequential numberof the RTP by reducing the sequential number of the first transmissionpacket of the respective transmission block from 16 to 8 bits. This isachieved, for instance, by deleting the higher-value places in thehexadecimal code, thereby reducing this, for example, from OxDC36 to0x36.

FIG. 6 shows the structure of a transmission system S. The transmissionsystem S contains a camera K, an encoder C, a faulty transmissionchannel Ü, a decoder D, and a display device F. Image data generated bythe camera K is encoded in the encoder C, transmitted on themalfunctioning transmission channel Ü, decoded by the decoder D, anddisplayed by the display device F. The encoder C and/or decoder Doperate(s), in particular, in conformity with an image compressionstandard such as, for example, MPEG1, MPEG2, MPEG4, H.261, H.263, orH.26L. The encoder and/or decoder operate(s), in particular, taking themethod according to the present invention into consideration.

FIG. 7 shows a processor unit PRZE. The processor unit PRZE contains aprocessor CPU, a memory MEM, and an input/output interface IOS is usedin a variety of ways via an interface IFC. An output is visualized on amonitor MON and/or fed out on a printer PRT via a graphic interface.Inputs are made via a mouse MAS or a keyboard TAST. The processor unitPRZE also has a data bus BUS providing the connection of a memory MEM,the processor CPU, and the input/output interface IOS. Additionalcomponents such as, for example, an additional memory, data storagemedium (hard disk), or scanner furthermore can be connected to the databus BUS.

Although the present invention has been described with reference tospecific embodiments, those of skill in the art will recognize thatchanges may be made thereto without departing from the spirit and scopeof the present invention as set forth in the hereafter appended claims.

References:

-   [1]H. Schulzrinne, S. Casner, R. Frederick, V. Jacobson: “RTP: A    Transport Protocol for Real Time Applications”, Chapter 5.1, RFC    1889, Internet Engineering Task Force, January 1996 (internet    address as at Mar. 28, 2002:-   [2]http://www.freesoft.org/CIE/RFC/1889)-   A. Falkenberg: “Kodier-/Dekodiervorrichtung zum Durchffihren eines    Block-Interleaving/Deinterleaving” (meaning: Encoding/decoding    device for performing block interleaving/de-interleaving), Patent    Specification DE 198 44 140 C 1-   [3]Duden Informatik, p. 553, Dudenverlag 2001-   [4]C. Schuler: “Design and Implementation of an Adaptive Error    Control Protocol”, Chapter 2.1, GMD Research Series; 1999, No. 21    (internet address as at Apr. 25, 2002:    http://www.gmd.de/publications/research/1999/021/)-   [4]G. Bäse, G. Liebl: “Generic erasure protection with inband    signaling of protection profiles”, ITU Telecommunication    Standardization Sector, H.323 Annex I, November 2000 (internet    address as at Apr. 8, 2002:    http://standards.pictel.corn/ftp/avcsite/till_(—)0012/0011₁₃    Gen/APC-1992.zip)

1-19. (canceled)
 20. A method for one of encoding and decoding asequence of digital data, the method comprising: providing that aportion of the sequence of digital data corresponds to a data block;providing that the data block include a plurality of data packets;providing that the data packets contain an identifier, with a positionof each respective data packet within the associated data block beingdetermined based on the identifier; providing that the data packetscontain information relating to a width of the data block; providingthat at least one data packet per data block contains the identifier andat least one further data packet contains the information relating tothe width of the data block; and transmitting, alternately, theidentifier and the information relating to the width of the data blockaccording to a predefinable repetition pattern, in a data field, whereinthe data is respectively one of encoded and decoded in consideration ofthe identifier.
 21. A method for one of encoding and decoding a sequenceof digital data as claimed in claim 20, wherein the sequence of digitaldata contains a sequence of progressive data.
 22. A method for one ofencoding and decoding a sequence of digital data as claimed in claim 20,wherein the sequence of digital data contains a sequence of digitalimage data.
 23. A method for one of encoding and decoding a sequence ofdigital data as claimed in claim 20, wherein the data block containsredundancy information.
 24. A method for one of encoding and decoding asequence of digital data as claimed in claim 20, wherein a start and anend of the data block are determined via the identifier.
 25. A methodfor one of encoding and decoding a sequence of digital data as claimedin claim 20, wherein a number of data packets containing the identifieris predefined such that every n-th data packet receives the identifier.26. A method for one of encoding and decoding a sequence of digital dataas claimed in claim 20, wherein a number of data packets containing theidentifier is predefined such that the data field of every n-th datapacket contains the identifier and at least some of the remaining datapackets respectively contain the width of the data block in theirrespective data fields.
 27. A method for one of encoding and decoding asequence of digital data as claimed in claim 20, wherein at least twodata packets contain the identifier and are every other data packet. 28.A method for one of encoding and decoding a sequence of digital data asclaimed in claim 20, wherein the data block is an interleaver block. 29.A method for one of encoding and decoding a sequence of digital data asclaimed in claim 20, wherein a sequence of the data blocks isdetermined.
 30. A method for one of encoding and decoding a sequence ofdigital data as claimed in claim 20, wherein a sequence of the datablocks is determined based on at least one of a time stamp and a serialnumber.
 31. A method for one of encoding and decoding a sequence ofdigital data as claimed in claim 20, wherein a Real-Time TransferProtocol is used as protocol.
 32. A method for one of encoding anddecoding a sequence of digital data as claimed in claim 20, wherein theidentifier for determining the position of the data packet within thedata block is a sequential number.
 33. A method for one of encoding anddecoding a sequence of digital data as claimed in claim 31, wherein theidentifier for determining the position of the data packet within thedata block is determined from the sequential number of a Real-TimeTransfer Protocol used.
 34. A method for one of encoding and decoding asequence of digital data as claimed in claim 20, wherein an unequalerror protection method is used.
 35. A method for one of encoding anddecoding a sequence of digital data as claimed in claim 34, wherein theunequal error protection method used is a USP method.
 36. A system forone of encoding and decoding a sequence of digital data, comprising aprocessor unit which provides that a portion of the sequence of digitaldata is a data block, the data block include a plurality of datapackets, the data packets contain an identifier based on which aposition of each respective data packet within the associated data blockis determined, the data packets contain information relating to a widthof the data block, at least one data packet per data block contains theidentifier and at least one further data packet contains the informationrelating to the width of the data block, the identifier and theinformation relating to the width of the data block are alternatelytransmitted according to a predefinable repetition pattern, in a datafield, and the data is respectively one of encoded and decoded inconsideration of the identifier.